Cellular automaton for bacterial towers
نویسندگان
چکیده
A simulation approach to the stochastic growth of bacterial towers is presented, in which a non-uniform and finite nutrient supply essentially determines the emerging structure through elementary chemotaxis. The method is based on cellular automata and we use simple, microscopic, local rules for bacterial division in nutrient-rich surroundings. Stochastic nutrient diffusion, while not crucial to the dynamics of the total population, is influential in determining the porosity of the bacterial tower and the roughness of its surface. As the bacteria run out of food, we observe an exponentially rapid saturation to a carrying capacity distribution, similar in many respects to that found in a recently proposed phenomenological hierarchical population model, which uses heuristic parameters and macroscopic rules. Complementary to that phenomenological model, the simulation aims at giving more microscopic insight into the possible mechanisms for one of the recently much studied bacterial morphotypes, known as “towering biofilm”, observed experimentally using confocal laser microscopy. A simulation suggesting a mechanism for biofilm resistance to antibiotics is also shown.
منابع مشابه
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملOn the Height of Towers of Subsequences and Prefixes
A tower is a sequence of words alternating between two languages in such a way that every word is a subsequence of the following word. The height of the tower is the number of words in the sequence. If there is no infinite tower (a tower of infinite height), then the height of all towers between the languages is bounded. We study upper and lower bounds on the height of maximal finite towers wit...
متن کاملI-homomorphism for BL-I-General L-fuzzy Automata
Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...
متن کاملADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON
In this note, we define the concepts of admissible relation and admissible partition for an arbitrary BL-general fuzzy automaton.In particular, a connection between the admissible partition and the quotient BL-general fuzzy automaton is presented.It is shown that if we use the maximal admissible partition, then we obtain a quotient BL-general fuzzy automaton and this quotient is minimal. Finall...
متن کاملNovel Subtractor Design Based on Quantum-Dot Cellular Automata (QCA) Nanotechnology
Quantum-dot cellular automaton (QCA) is a novel nanotechnology with a very different computational method in compared with CMOS, whereas placement of electrons in cells indicates digital information. This nanotechnology with specifications such as fast speed, high parallel processing, small area, low power consumption and higher switching frequency becomes a promising candidate for CMOS tec...
متن کامل